Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
نویسندگان
چکیده
منابع مشابه
Second Order Cone Programming Relaxation of Nonconvex Quadratic Optimization Problems
A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems lies in its expensive computational cost. This paper proposes a SOCP (second-order-cone programming) relaxation method, which strengthens the lift-and-project LP (linear programming) relaxation method by adding convex quadratic valid inequalities for the positive semid...
متن کاملSecond-Order Cone Relaxations for Binary Quadratic Polynomial Programs
Several types of relaxations for binary quadratic polynomial programs can be obtained using linear, secondorder cone, or semidefinite techniques. In this paper, we propose a general framework to construct conic relaxations for binary quadratic polynomial programs based on polynomial programming. Using our framework, we re-derive previous relaxation schemes and provide new ones. In particular, w...
متن کاملExact Computable Representation of Some Second-Order Cone Constrained Quadratic Programming Problems
Solving the quadratically constrained quadratic programming (QCQP) problem is in general NP-hard. Only a few subclasses of the QCQP problem are known to be polynomial-time solvable. Recently, the QCQP problem with a nonconvex quadratic objective function over one ball and two parallel linear constraints is proven to have an exact computable representation, which reformulates the original proble...
متن کاملSolving Quadratic Assignment Problems Using Convex Quadratic Programming Relaxations
We describe a branch and bound algorithm for the quadratic assignment problem QAP that uses a convex quadratic programming QP relaxation to obtain a bound at each node The QP subproblems are approximately solved using the Frank Wolfe algorithm which in this case requires the solution of a linear assignment problem on each iteration Our branching strategy makes extensive use of dual information ...
متن کاملOn Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some important results on QCQP, like the S-Procedure, and the strength of Lagrangian Relaxation and the semi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2020
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556788.2020.1827256